# large sieve method

﻿
large sieve method
Математика: метод большого решета

Универсальный англо-русский словарь. . 2011.

### Смотреть что такое "large sieve method" в других словарях:

• Large sieve — In mathematics, the large sieve is a method of analytic number theory. As the name implies, it was developed in sieve theory, (for example) sifting from an integer sequence by means of congruence conditions modulo prime numbers in which a… …   Wikipedia

• Large (disambiguation) — Large is an English surname.Large may also refer to:In botany:* Large flowered bellwort, plant in the family Liliaceae * Large fruited Elm, small deciduous tree or large shrub endemic to the Far East excluding JapanIn literature:* Geraldo at… …   Wikipedia

• Sieve of Eratosthenes — Sieve of Eratosthenes: algorithm steps for primes below 121 (including optimization of starting from prime s square). In mathematics, the sieve of Eratosthenes (Greek: κόσκινον Ἐρατοσθένους), one of a number of prime number sieves, is a simple,… …   Wikipedia

• Sieve analysis — A sieve analysis is a practice or procedure used to assess the particle size distribution of a granular material. The size distribution is often of critical importance to the way the material performs in use. A sieve analysis can be performed on… …   Wikipedia

• Quadratic sieve — The quadratic sieve algorithm (QS) is a modern integer factorization algorithm and, in practice, the second fastest method known (after the general number field sieve). It is still the fastest for integers under 100 decimal digits or so, and is… …   Wikipedia

• General number field sieve — In number theory, the general number field sieve (GNFS) is the most efficient classical algorithm known for factoring integers larger than 100 digits. Heuristically, its complexity for factoring an integer n (consisting of log2 n bits) is of …   Wikipedia

• Dixon's factorization method — In number theory, Dixon s factorization method (also Dixon s random squares method or Dixon s algorithm) is a general purpose integer factorization algorithm; it is the prototypical factor base method, and the only factor base method for which …   Wikipedia

• Special number field sieve — The special number field sieve (SNFS) is a special purpose integer factorization algorithm. The general number field sieve (GNFS) was derived from it.The special number field sieve is efficient for integers of the form r e plusmn; s , where r and …   Wikipedia

• Chakravala method — The chakravala method (Hindi: चक्रवाल विधि) is a cyclic algorithm to solve indeterminate quadratic equations, including Pell s equation. It is commonly attributed to Bhāskara II, (c. 1114 – 1185 CE) although some attribute it to Jayadeva (c …   Wikipedia

• Fermat's factorization method — is based on the representation of an odd integer as the difference of two squares: :N = a^2 b^2. That difference is algebraically factorable as (a+b)(a b); if neither factor equals one, it is a proper factorization of N .Each odd number has such… …   Wikipedia

• Legendre sieve — In mathematics, the Legendre sieve is the simplest method in modern sieve theory. It applies the concept of the Sieve of Eratosthenes to find upper or lower bounds on the number of primes within a given set of integers. Because it is a simple… …   Wikipedia

### Поделиться ссылкой на выделенное

##### Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.